Handling fairness issues in time-relaxed tournaments with availability constraints

Sports timetables determine who will play against whom, where, and on which time slot. In contrast to time-constrained sports timetables, time-relaxed timetables utilize (many) more time slots than there are games per team. This offers time-relaxed timetables additional flexibility to take into account venue availability constraints, stating that a team can only play at home when its venue is available, and player availability constraints stating that a team can only play when its players are available. Despite their flexibility, time-relaxed timetables have the drawback that the rest period between teams’ consecutive games can vary considerably, and the difference in the number of games played at any point in the season can become large. Besides, it can be important to timetable home and away games alternately. In this paper, we first establish the computational complexity of time-relaxed timetabling with availability constraints. Naturally, when one also incorporates fairness objectives on top of availability, the problem becomes even more challenging. We present two heuristics that can handle these fairness objectives. First, we propose an adaptive large neighborhood method that repeatedly destroys and repairs a timetable. Second, we propose a memetic algorithm that makes use of local search to schedule or reschedule all home games of a team. For numerous artificial and real-life instances, these heuristics generate high-quality timetables using considerably less computational resources compared to integer programming models solved using a state-of-the-art solver

Scheduling a non-professional indoor football league : a tabu search based approach

This paper deals with a real-life scheduling problem of a non-professional indoor football league. The goal is to develop a schedule for a time-relaxed, double round-robin tournament which avoids close successions of games involving the same team in a limited period of time. This scheduling problem is interesting, because games are not planned in rounds. Instead, each team provides time slots in which they can play a home game, and time slots in which they cannot play at all. We present an integer programming formulation and a heuristic based on tabu search. The core component of this algorithm consists of solving a transportation problem, which schedules (or reschedules) all home games of a team. Our heuristic generates schedules with a quality comparable to those found with IP solvers, however with considerably less computational effort. These schedules were approved by the league organizers, and used in practice for the seasons 2009-2010 till 2016-2017

An instance data repository for the round-robin sports timetabling problem

The sports timetabling problem is a combinatorial optimization problem that consists of creating a timetable that defines against whom, when and where teams play games. This is a complex matter, since real-life sports timetabling applications are typically highly constrained. The vast amount and variety of constraints and the lack of generally accepted benchmark problem instances make that timetable algorithms proposed in the literature are often tested on just one or two specific seasons of the competition under consideration. This is problematic since only a few algorithmic insights are gained. To mitigate this issue, this article provides a problem instance repository containing over 40 different types of instances covering artificial and real-life problem instances. The construction of such a repository is not trivial, since there are dozens of constraints that need to be expressed in a standardized format. For this, our repository relies on RobinX, an XML-supported classification framework. The resulting repository provides a (non-exhaustive) overview of most real-life sports timetabling applications published over the last five decades. For every problem, a short description highlights the most distinguishing characteristics of the problem. The repository is publicly available and will be continuously updated as new instances or better solutions become available

ROBO2 is a stroma suppressor gene in the pancreas and acts via TGF-β signalling

Whereas genomic aberrations in the SLIT-ROBO pathway are frequent in pancreatic ductal adenocarcinoma (PDAC), their function in the pancreas is unclear. Here we report that in pancreatitis and PDAC mouse models, epithelial Robo2 expression is lost while Robo1 expression becomes most prominent in the stroma. Cell cultures of mice with loss of epithelial Robo2 (Pdx1 ;Robo2 ) show increased activation of Robo1 myofibroblasts and induction of TGF-β and Wnt pathways. During pancreatitis, Pdx1 ;Robo2 mice present enhanced myofibroblast activation, collagen crosslinking, T-cell infiltration and tumorigenic immune markers. The TGF-β inhibitor galunisertib suppresses these effects. In PDAC patients, ROBO2 expression is overall low while ROBO1 is variably expressed in epithelium and high in stroma. ROBO2 ;ROBO1 patients present the poorest survival. In conclusion, Robo2 acts non-autonomously as a stroma suppressor gene by restraining myofibroblast activation and T-cell infiltration. ROBO1/2 expression in PDAC patients may guide therapy with TGF-β inhibitors or other stroma /immune modulating agents

MicroWalk: A Framework for Finding Side Channels in Binaries

Microarchitectural side channels expose unprotected software to information leakage attacks where a software adversary is able to track runtime behavior of a benign process and steal secrets such as cryptographic keys. As suggested by incremental software patches for the RSA algorithm against variants of side-channel attacks within different versions of cryptographic libraries, protecting security-critical algorithms against side channels is an intricate task. Software protections avoid leakages by operating in constant time with a uniform resource usage pattern independent of the processed secret. In this respect, automated testing and verification of software binaries for leakage-free behavior is of importance, particularly when the source code is not available. In this work, we propose a novel technique based on Dynamic Binary Instrumentation and Mutual Information Analysis to efficiently locate and quantify memory based and control-flow based microarchitectural leakages. We develop a software framework named \tool~for side-channel analysis of binaries which can be extended to support new classes of leakage. For the first time, by utilizing \tool, we perform rigorous leakage analysis of two widely-used closed-source cryptographic libraries: \emph{Intel IPP} and \emph{Microsoft CNG}. We analyze $15$ different cryptographic implementations consisting of $112$ million instructions in about $105$ minutes of CPU time. By locating previously unknown leakages in hardened implementations, our results suggest that \tool~can efficiently find microarchitectural leakages in software binaries

The effect of alcohol advertising, marketing and portrayal on drinking behaviour in young people: systematic review of prospective cohort studies

<p>Abstract</p> <p>Background</p> <p>The effect of alcohol portrayals and advertising on the drinking behaviour of young people is a matter of much debate. We evaluated the relationship between exposure to alcohol advertising, marketing and portrayal on subsequent drinking behaviour in young people by systematic review of cohort (longitudinal) studies.</p> <p>Methods</p> <p>studies were identified in October 2006 by searches of electronic databases, with no date restriction, supplemented with hand searches of reference lists of retrieved articles. Cohort studies that evaluated exposure to advertising or marketing or alcohol portrayals and drinking at baseline and assessed drinking behaviour at follow-up in young people were selected and reviewed.</p> <p>Results</p> <p>seven cohort studies that followed up more than 13,000 young people aged 10 to 26 years old were reviewed. The studies evaluated a range of different alcohol advertisement and marketing exposures including print and broadcast media. Two studies measured the hours of TV and music video viewing. All measured drinking behaviour using a variety of outcome measures. Two studies evaluated drinkers and non-drinkers separately. Baseline non-drinkers were significantly more likely to have become a drinker at follow-up with greater exposure to alcohol advertisements. There was little difference in drinking frequency at follow-up in baseline drinkers. In studies that included drinkers and non-drinkers, increased exposure at baseline led to significant increased risk of drinking at follow-up. The strength of the relationship varied between studies but effect sizes were generally modest. All studies controlled for age and gender, however potential confounding factors adjusted for in analyses varied from study to study. Important risk factors such as peer drinking and parental attitudes and behaviour were not adequately accounted for in some studies.</p> <p>Conclusion</p> <p>data from prospective cohort studies suggest there is an association between exposure to alcohol advertising or promotional activity and subsequent alcohol consumption in young people. Inferences about the modest effect sizes found are limited by the potential influence of residual or unmeasured confounding.</p